气象卫星的军事应用

为了研究全球气象卫星在军事领域的应用情况,通过对相关国家气象卫星的种类以及军事应用的特点、简要发展史、现状,以及在现代战争中的应用等情况进行了阐述,并重点介绍了气象卫星在伊拉克战争中的应用,结果表明气象卫星作为信息化军队的重要资源之一,对国防建设,尤其是对现代高技术条件下的局部战争具有深远的影响。     

Manpower allocation with time windows and job‐teaming constraints

In this work, we study manpower allocation with time windows and job‐teaming constraints. A set of jobs at dispersed locations requires teams of different types of workers where each job must be carried out in a preestablished time window and requires a specific length of time for completion. A job is satisfied if the required composite team can be brought together at the job's location for the required duration within the job's time window. The objective is to minimize a weighted sum of the total number of workers and the total traveling time. We show that construction heuristics used with simulated annealing is a good approach to solving this NP‐hard problem. In experiments, this approach is compared with solutions found using CPLEX and with lower bounds obtained from a network flow model. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Single machine scheduling with a restricted rate‐modifying activity

In this paper we consider the problem of scheduling a set of jobs on a single machine on which a rate‐modifying activity may be performed. The rate‐modifying activity is an activity that changes the production rate of the machine. So the processing time of a job is a variable, which depends on whether it is scheduled before or after the rate‐modifying activity. We assume that the rate‐modifying activity can take place only at certain predetermined time points, which is a constrained case of a similar problem discussed in the literature. The decisions under consideration are whether and when to schedule the rate‐modifying activity, and how to sequence the jobs in order to minimize some objectives. We study the problems of minimizing makespan and total completion time. We first analyze the computational complexity of both problems for most of the possible versions. The analysis shows that the problems are NP‐hard even for some special cases. Furthermore, for the NP‐hard cases of the makespan problem, we present a pseudo‐polynomial time optimal algorithm and a fully polynomial time approximation scheme. For the total completion time problem, we provide a pseudo‐polynomial time optimal algorithm for the case with agreeable modifying rates. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

中继卫星调度问题的CSP模型

中继卫星在地球同步静止轨道上运行,既能直视中、低轨道用户航天器,又能直视地面站,是沟通用户航天器与地面站的桥梁。中继卫星调度问题是一类非常重要的调度问题。基于约束满足理论,通过分析中继卫星调度问题的特点与约束条件,建立了中继卫星调度问题的CSP模型。利用卫星工具箱STK进行模拟仿真,对CSP模型进行了求解。结果表明,所建立的CSP模型是合理的。     

伽利略导航系统若干关键技术分析

分析了目前最新的卫星导航定位系统———伽利略系统所采用的若干关键技术.从卫星轨道布置方式、信号与频率设计方法、伪卫星技术及信号服务等几个方面与GPS进行了对比研究.研究结果表明,Galileo系统具有定位精度高、兼容性好、功能全等优点,在新一代导航系统中具有重要地位.     

Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost

In the last decade, there has been much progress in understanding scheduling problems in which selfish jobs aim to minimize their individual completion time. Most of this work has focused on makespan minimization as social objective. In contrast, we consider as social cost the total weighted completion time, that is, the sum of the agent costs, a standard definition of welfare in economics. In our setting, jobs are processed on restricted uniform parallel machines, where each machine has a speed and is only capable of processing a subset of jobs; a job's cost is its weighted completion time; and each machine sequences its jobs in weighted shortest processing time (WSPT) order. Whereas for the makespan social cost the price of anarchy is not bounded by a constant in most environments, we show that for our minsum social objective the price of anarchy is bounded above by a small constant, independent of the instance. Specifically, we show that the price of anarchy is exactly 2 for the class of unit jobs, unit speed instances where the finite processing time values define the edge set of a forest with the machines as nodes. For the general case of mixed job strategies and restricted uniform machines, we prove that the price of anarchy equals 4. From a classical machine scheduling perspective, our results establish the same constant performance guarantees for WSPT list scheduling. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

基于变频转发RDSS信号模拟的参数生成算法

近年来,有源与无源体制兼容型的RDSS接收机技术的迅速发展对与之匹配的高精度卫星信号模拟器的研制提出了迫切需求.模拟器主要包含卫星轨道仿真、用户轨迹仿真、误差建模、信号生成参数计算等模块.其中信号生成参数的模拟是需要解决的一项关键技术.但由于RDSS卫星导航系统的信号播发具有变频转发的特点,使得信号参数的模拟变得比GPS等直播式系统复杂.为此,提出了一种适合变频转发的卫星信号生成参数算法,并推导了多普勒频移参数计算公式.仿真实验结果验证了文中算法的正确性.     

一种GNSS卫星轨道高精度实时插值方法

针对GNSS导航信号模拟源中多星座轨道计算实时性问题,从计算效率、精度等角度分析和对比了牛顿多项式和埃尔米特多项式插值算法的性能,通过对牛顿插值的加“窗”改进,使得卫星位置、速度的插值精度显著提高.算例结果表明,该方法能够在等间距时间点上多个卫星位置已知、速度未知的条件下,高精度实时地内插出卫星的位置和速度,其中卫星位置插值精度为mm级,速度插值精度小于1e-5 m/s,计算量为广播星历直接计算的1/7,位置和速度的拟合精度均优于三阶埃尔米特插值结果.     

星载干涉仪无源定位新方法及其误差分析

针对传统单星二维干涉仪测向定位存在的设备量大、易受通道间幅度/相位不一致性影响等缺点,提出了在单颗自旋卫星上只安装两个接收通道构成一维干涉仪,测量相位差变化率的无源定位新方法,采用了基于粒子群优化(PSO)的定位算法,分析了干涉仪转速以及旋转平面对定位性能的影响.结果表明,增大干涉仪转速有利于提高定位精度,为了使星下点周围各个方向上都有较好的定位精度,干涉仪旋转平面应与初始观测时刻卫星位置矢量垂直,PS0算法的定位精度能够接近定位误差的克拉美罗下限(CRLB).     

四层梯阶控制在卫星编队的应用仿真

研究了四层阶梯控制在卫星编队的控制问题及仿真。利用卫星相对运动的线性方程组和轨道机动算法的基础上,结合卫星任务规划、行为决策、行为规划和操作控制的四层阶梯卫星编队结构,从而建立建立卫星编队绕飞半径的滤波控制。仿真结果表明了四层阶梯控制在卫星编队在上对运动过程中,缩小卫星之间相对距离变换范围,增强卫星编队的稳定性。